Derivation of concurrent programs: two examples
نویسندگان
چکیده
منابع مشابه
Derivation of Systolic Programs
We describe a methodology for mapping linear recurrence equations to a spectrum of systolic architectures. First, we design a systolic program in a very general architecture referred to as Basic Systolic Architecture and establish the correctness of the implementation. Next, we show how ef-cient transformations/implementations of programs for diierent systolic architectures can be obtained thro...
متن کاملThe Derivation of Compositional Programs
This paper proposes a parallel programming notation and a method of reasoning about programs with the following characteristics: 1. Parallel Composition The notation provides diierent forms of interfaces between processes; the more restrictive the interface, the simpler the proofs of process composition. A exible interface is that of cooperating processes with a shared address space; proofs of ...
متن کاملFormal Derivation of CSP Programs
The algebra of relations has been very successful for reasoning about possibly non-deterministic programs, provided their behaviour can be fully characterized by just their initial and nal states. We use a slight generalization, called sequential algebra, to extend the scope of relation-algebraic methods to reactive systems, where the behaviour between initiation and termination is also importa...
متن کاملSystematic Derivation of Incremental Programs
A systematic approach is given for deriving incremental programs from non incremental programs written in a standard functional programming language We exploit a number of program analysis and transformation techniques and domain speci c knowledge centered around e ective utilization of caching in order to provide a degree of incrementality not otherwise achievable by a generic incremental eval...
متن کاملTesting of Concurrent Programs
Testing concurrent systems requires exploring all possible non-deterministic interleavings that the concurrent execution may have, as any of the interleavings may reveal erroneous behaviour. This introduces a new problem: the well-known state space problem, which is often computationally intractable. In the present thesis, this issue will be addressed through: (1) the development of new Partial...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Science of Computer Programming
سال: 1992
ISSN: 0167-6423
DOI: 10.1016/0167-6423(92)90002-s